// #include "./ring_seq_queue.cpp"
#include "./ring_linklist_queue.cpp"

int main()
{
    Queue q = InitQueue();
    printf("[read front]\n");
    printf("front item: %d\n", Front(q));
    for (int i = 0; i < 15; i++)
    {
        int item = 2 * i + 1;
        Push(q, item);
        printf("[inQueue] %d\t", item);
        if ((i + 1) % 5 == 0)
        {
            printf("\n");
        }
    }
    printf("\n");
    printf(q);
    for (int i = 0; i < 2; i++)
    {
        printf("[deQueue]\n");
        Pop(q);
        printf(q);
        printf("front item: %d\n", Front(q));
        printf("rear  item: %d\n", Back(q));
    }
    return 0;
}
